Axiomatizations of Permission Values for Games with a Hierarchical Permission Structure using Split Neutrality
نویسندگان
چکیده
منابع مشابه
Axiomatizations of Banzhaf permission values for games with a permission structure
In games with a permission structure it is assumed that players in a cooperative transferable utility game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. We provide axiomatic characterizations of Banzhaf permission values being solutions that are obtained by applying the Banzhaf value to modified TU-ga...
متن کاملGames with fuzzy permission structure: A conjunctive approach
A cooperative game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate, regardless of the actions that the other players take. A permission structure over the set of players describes a hierarchical organization where there are players who need permission from certain ...
متن کاملThe Average Tree Permission Value for Games with a Permission Tree
In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players...
متن کاملA Permission Based Hierarchical Algorithm for Mutual Exclusion
Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of co...
متن کاملComparable Characterizations of Four Solutions for Permission Tree Games
In the field of cooperative games there is an extensive literature that studies situations of restricted cooperation. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson value of such a game is obtained by taking the Shapley value of the corresponding restrict...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2003
ISSN: 1556-5068
DOI: 10.2139/ssrn.482262